Reid et al.'s distance bounding protocol and mafia fraud attacks over noisy channels

Mafia fraud attack against the RČ Distance-Bounding Protocol

At ACM CCS 2008, Rasmussen and Čapkun introduced a distance-bounding protocol [22] (henceforth RČ protocol) where the prover and verifier use simultaneous transmissions and the verifier counts the delay between sending a challenge (starting with a hidden marker) and receiving the response. Thus, the verifier is able to compute an upper bound on the distance separating it and the prover. Distanc...

Maa Fraud Attacks over Noisy Channels

Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, maa fraud and terrorist fraud attacks. Reid et al. proposed the rst symmetric key distance bounding protocol against maa and terrorist fraud attacks [1]. However, [2] claims that this is only achieved with a (7/8) probability of success for maa fraud, rather than the theoretical value...

Rational distance-bounding protocols over noisy channels

We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels in a distance-bounding protocol. The optimal threshold will ensure that even if an intruder attempts to cause incorrect authentication, the expected loss the verifier suffers will still be lower than when the intruder do...

Complexity of Distance Fraud Attacks in Graph-Based Distance Bounding

Distance bounding (DB) emerged as a countermeasure to the so-called relay attack, which affects several technologies such as RFID, NFC, Bluetooth, and Ad-hoc networks. A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds. The security analysis in terms of distance fraud is performed by considering an adversary that,...

Towards Secure IFF: Preventing Mafia Fraud Attacks